Quasigroup representation of some lightweight block ciphers
نویسندگان
چکیده
Most of the lightweight block ciphers are build as S-P networks or Feistel networks, their generalization or variations. We represent the lightweight Feistel ciphers GOST and MIBS, and Generalized Feistel cipher Skipjack by quasigroup string transformations. For obtaining suitable representation we use the fact that Feistel round functions that are bijections can be considered as orthomorphisms of groups, and that give us a tool for creating wanted quasigroups.
منابع مشابه
Research, Implementation and Application of the SQBC Block Cipher in the Area of Encrypting Images
The application of block ciphers in the modern society is enormous. One branch of this development is getting a new dimension – the application of quasigroups and quasigroup transformations in the block ciphers. This paper contains the results of the research involving the family of block ciphers named SQBC (Small Quasigroup Block Cipher), which is based on quasigroups and quasigroup transforma...
متن کاملA Survey of Cryptanalytic Attacks on Lightweight Block Ciphers
Lightweight block ciphers are used in applications where low power consumption is a requirement along with hardware area constraints regarding their implementation. Design of these ciphers demands an optimal tradeoff between computational efficiency and security. These ciphers being supportive in fast and secure transmission of data from one location to another are prone to several attacks that...
متن کاملMILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck
In recent years, Mixed Integer Linear Programming (MILP) has been successfully applied in searching for differential characteristics and linear approximations in block ciphers and has produced the significant results for some ciphers such as SIMON (a family of lightweight and hardware-optimized block ciphers designed by NSA) etc. However, in the literature, the MILP-based automatic search algor...
متن کاملAlgebraic Attack Efficiency versus S-box Representation
Algebraic analysis of block ciphers aims at finding the secret key by solving a collection of polynomial equations that describe the internal structure of a cipher for chosen observations of plaintext/ciphertext pairs. Although algebraic attacks are addressed for cryptanalysis of block and stream ciphers, there is a lack of understanding of the impact of algebraic representation of the cipher o...
متن کاملExploring Energy Efficiency of Lightweight Block Ciphers
In the last few years, the field of lightweight cryptography has seen an influx in the number of block ciphers and hash functions being proposed. One of the metrics that define a good lightweight design is the energy consumed per unit operation of the algorithm. For block ciphers, this operation is the encryption of one plaintext. By studying the energy consumption model of a CMOS gate, we arri...
متن کامل